Research on Fast Lock Anchorage Tools

Sable Research Group Component - Based Lock Allocation

The choice of lock objects in concurrent programs can affect both performance and correctness, a burden of complexity for programmers. Recently, various automated lock allocation and assignment techniques have been proposed, each aiming primarily to minimize the number of conflicts between critical sections. However, practical performance depends on a number of important factors, including the ...

Fast and Scalable, Lock-Free k-FIFO Queues

We introduce fast and scalable algorithms that implement boundedand unbounded-size lock-free k-FIFO queues on parallel, shared memory hardware. Logically, a k-FIFO queue can be understood as queue where elements may be dequeued out-of-order up to k 1, or as pool where the oldest element is dequeued within at most k dequeue operations. The presented algorithms enable up to k enqueue and k dequeu...

Frequency detector for fast frequency lock of digital PLLs

Introduction: A wide tuning range for a PLL can be achieved by incorporating a frequency-locked loop (FLL) in parallel with the PLL. The key building block of an FLL is the frequency detector (FD) that determines the difference between the oscillator’s divided clock (CKV) and the reference clock (REF). There are many ways to accomplish frequency lock in digital PLLs, but all of them suffer from...

Designing a Genetic-Fuzzy Anti-Lock Brake System Controller (RESEARCH NOTE)

A Fast and Low Overhead Distributed Priority Lock

Distributed synchronization is necessary to coordinate the diverse activities of a distributed system. Priority synchronization is needed for real time systems, or to improve the performance of critical tasks. We present a distributed priority lock that uses Li and Hudak's path compression methods to achieve a theoretical O(log n) messages per critical section request, where n is the number of ...